Orbit Polynomial of Graphs versus Polynomial with Integer Coefficients
نویسندگان
چکیده
Suppose ai indicates the number of orbits size i in graph G. A new counting polynomial, namely an orbit is defined as OG(x) = ?i aixi. Its modified version obtained by subtracting polynomial from 1. In present paper, we studied conditions under which integer can arise a graph. Additionally, surveyed graphs with small and characterized several classes respect to their polynomials.
منابع مشابه
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملGraphs with Integer Matching Polynomial Roots
In this paper, we study graphs with integer matching polynomial roots. We characterize all traceable graphs whose all matching polynomial roots are integer. We show that there is no k-regular claw-free graph (k ≥ 2), whose all matching polynomial roots are integer. Also we conjecture that apart from K7 \ (E(C3) ∪E(C4)), there is no matching integral k-regular graph (k ≥ 2). 2010 Mathematics Sub...
متن کاملSmall solutions to systems of polynomial equations with integer coefficients
The paper discusses a series of conjectures due to A. Tyszka aiming to describe boxes in which there exists at least one solution to a system of polynomial equations with integer coefficients. A proof of the bound valid in the linear case is given. 1 Two basic questions When facing systems of equations whose solutions are hard to determine, one is satisfied to determine (or at least estimate) t...
متن کاملThe Hyper-Wiener Polynomial of Graphs
The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...
متن کاملIdempotents with polynomial coefficients
We combine Young idempotents in the group algebra of the symmetric group with the action of the symmetric group on products of Vandermonde determinants to obtain idempotents with polynomial coefficients.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2021
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym13040710